Search results for "Piecewise Deterministic Markov Process"

showing 2 items of 2 documents

Quantitative ergodicity for some switched dynamical systems

2012

International audience; We provide quantitative bounds for the long time behavior of a class of Piecewise Deterministic Markov Processes with state space Rd × E where E is a finite set. The continuous component evolves according to a smooth vector field that switches at the jump times of the discrete coordinate. The jump rates may depend on the whole position of the process. Under regularity assumptions on the jump rates and stability conditions for the vector fields we provide explicit exponential upper bounds for the convergence to equilibrium in terms of Wasserstein distances. As an example, we obtain convergence results for a stochastic version of the Morris-Lecar model of neurobiology.

Statistics and ProbabilitySwitched dynamical systemsDynamical systems theoryMarkov process01 natural sciences34D2393E15010104 statistics & probabilitysymbols.namesakeCouplingPiecewise Deterministic Markov ProcessPosition (vector)60J25FOS: MathematicsState spaceApplied mathematicsWasserstein distance0101 mathematicsMathematicsProbability (math.PR)010102 general mathematicsErgodicityErgodicity[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Linear Differential EquationsPiecewisesymbolsJumpAMS-MSC. 60J75; 60J25; 93E15; 34D23Vector fieldStatistics Probability and Uncertainty60J75[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - Probability
researchProduct

Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *

2013

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Variable length Markov chainProbability (math.PR)Semi Markov processesIntegrated telegraph noise[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Mathematics::ProbabilitySimple and double infinite combs.Variable memoryFOS: Mathematics[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityPersistent random walkSimple and double infinite combsPiecewise Deterministic Markov Processes
researchProduct